Random non-cupping revisited

نویسنده

  • George Barmpalias
چکیده

Say that Y has the strong random anticupping property if there is a set A such that for every Martin-Löf random set R

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-cupping and Randomness

Let Y ∈ ∆2 be Martin-Löf-random. Then there is a promptly simple set A such that for each Martin-Löf-random set Z, Y ≤T A ⊕ Z ⇒ Y ≤T Z. When Y = Ω, one obtains a c.e. non-computable set A which is not weakly Martin-Löf cuppable. That is, for any Martin-Löf-random set Z, if ∅′ ≤T A⊕ Z, then ∅′ ≤T Z.

متن کامل

Measure and Cupping in the Turing Degrees

We answer a question of Jockusch by showing that the measure of the Turing degrees which satisfy the cupping property is 0. In fact, every 2-random degree has a strong minimal cover, and so fails to satisfy the cupping

متن کامل

Bertrand’s Paradox Revisited: More Lessons about that Ambiguous Word, Random

The Bertrand paradox question is: “Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a ‘random’ chord of a unit-radius circle has length greater than 3 .” Bertrand derived three different ‘correct’ answers, the correctness depending on interpretation of the word, random. Here we employ geomet...

متن کامل

Differentiating Glaucomatous from Non-Glaucomatous Optic Nerve Cupping by Optical Coherence Tomography

BACKGROUND In clinical practice, the differentiation of glaucomatous from non-glaucomatous cupping can be difficult, even for experienced observers. The purpose of this study was to evaluate the role of optical coherence tomography (OCT) in differentiating glaucomatous from non-glaucomatous optic nerve cupping in a cross-sectional pilot study. METHODS Eleven consecutive patients presenting to...

متن کامل

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Complexity

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2006